On-Line Algorithms for Due Date Quotation with Lateness Penalties
نویسندگان
چکیده
We present a novel model for due date quotation. Jobs arrive at a single server or m-machine flow shop over time. Upon arrival, the processing times on each machine of the job are known, and due dates must be quoted for each job. The jobs are sequenced on the machines without preemption. Associated with each job, there are three measures of disadvantages to the inventory cost and the service level: quoted lead time cost, earliness penalties (holding cost), and lateness (or tardiness) penalties. The objective of this problem is to minimize the sum of weighted quoted lead times, weighted earliness, and weighted lateness of all jobs. We propose an on-line heuristic, partially characterize its performance relative to a first come, first served policy, and computationally test its performance.
منابع مشابه
Centralized Versus Decentralized Scheduling and Due Date Quotation in a Make-to-Order Supply Chain
Although there is a vast and growing amount of literature on supply chain coordination, the majority of this literature focuses on make-to-stock systems and performance measures built around service and inventory levels. On the other hand, an increasing number of supply chains are better characterized as make-to-order systems. Fast and on-time delivery is obviously critical for any firm that op...
متن کاملAnalysis of On-Line Algorithms for Due Date Quotation
We present a novel model for due date quotation. Jobs arrive at a single server over time. Upon arrival, the processing time of each job is known, and due dates must be quoted for each job. The jobs must be sequenced on the server so that all jobs complete processing at or before their due dates, and the sum of quoted due dates is minimized. We develop several variations of an on-line heuristic...
متن کاملSimultaneous Due Date Assignment and Lot Sizing with Uncertain Flow Times
Due date assignment for customer orders has been studied in various productionenvironments using different modeling approaches. In this paper the researchers consider aproduction system in which the orders of several customers are produced in a single batch because ofthe economy of scale. If a batch is completed before receiving customer orders, inventory carryingcost is incurred but if it is c...
متن کاملCAREER: Scheduling of Large-Scale Systems: Probabilistic Analysis and Practical Algorithms for Due Date Quotation
We present a novel single facility due-date quotation model and algorithm, and characterize the effectiveness of this algorithm employing the tools of probabilistic analysis. This model is intended to be a building block for the models that we will use to analyze due date quotation in make-to-order supply chains, and we present a summary of these models.
متن کاملInventory Positioning, Scheduling and Due-Date Quotation in Supply Chains
We consider supply chain networks composed of several centrally managed production facilities as well as external suppliers. We design effective heuristics for inventory positioning, order sequencing, and short and reliable due date quotation for this supply chain. We perform extensive computational testing to assess the effectiveness of our algorithms, and we explore the impact of supply chain...
متن کامل